Comparative Metric Semantics for Commit in OR-Parallel Logic Programming
نویسندگان
چکیده
For the control ow kernel of or-parallel Prolog with commit an operational and a denotational model are constructed and related using techniques from metric semantics. By maintaining explicit scope information a compositional handling of the commit for the denotational model is established. By application of an abstraction function, which deletes this extra information, the operational semantics is recovered.
منابع مشابه
Comparative Semantics of Generalized Horn Clauses1
The purpose of this paper is to present and analyze semantically a new extension of concurrent logic programming languages aiming at handling synchronicity. It essentially rests on an extension of Horn clauses, called generalized Horn clauses, and on a new parallel operator between goals. Five semantics are presented and compared. They range in the operational, declarative and denotational type...
متن کاملTowards a New Massively Parallel Computational Model for Logic Programming
The semantics of logic programs is commonly deened as the least xed point of an appropriate meaning operator. In case of normal programs, however, some undesired results do occur and it has recently been suggested to apply metric methods in order to overcome these problems. We show in this paper that these metric methods can be directly implemented by recurrent connectionist networks giving ris...
متن کاملTowards a New Massively Parallel Computational Model for Logic Programming
The semantics of logic programs is commonly deened as the least xed point of an appropriate meaning operator. In case of normal programs, however, some undesired results do occur and it has recently been suggested to apply metric methods in order to overcome these problems. We show in this paper that these metric methods can be directly implemented by recurrent connectionist networks giving ris...
متن کاملContribution to Semantics of a Data-Parallel Logic Programming Language
We propose an alternate approach to the usual introduction of parallelism in logic programming. Instead of detecting the intrinsic parallelism by an automatic and complex data-ow analysis, or upgrading standard logic languages by explicit concurrent control structures leading to task-oriented languages, we tightly integrate the concepts of the data-parallel programming model and of logic progra...
متن کاملCoalgebraic Semantics for Parallel Derivation Strategies in Logic Programming
Logic programming, a class of programming languages based on first-order logic, provides simple and efficient tools for goal-oriented proof-search. Logic programming supports recursive computations, and some logic programs resemble the inductive or coinductive definitions written in functional programming languages. In this paper, we give a coalgebraic semantics to logic programming. We show th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997